SVA and PSL Local Variables - A Practical Approach

Mapping SVA to PSL

Note that local variables and first match are not in the domain of the mapping. Throughout, “unclocked SVA sequence” means “unclocked SVA sequence without local variables or first match”. Similarly, “clocked SVA sequence” means “clocked SVA sequence without local variables or first match”. In the following abstract grammars, b denotes a boolean expression, v denotes a local variable name, and e...

Structural Contradictions

We study the relation between logical contradictions such as p ∧ ¬p and structural contradictions such as p∩ (p · q). Intuitively, we expect the two to be treated similarly, but they are not by PSL, nor by SVA. We provide a solution that treats both kinds of contradictions in a consistent manner. The solution reveals that not all structural contradictions are created equal: we must distinguish ...

Psl and Sva: Two Standard Assertion Languages Addressing Complementary Engineering Needs

Proposal for Extending Annex B of PSL with Local Variables, Procedural Blocks, Past Expressions and Clock Alignment Operators

In this document we extend Proposal A’ for augmenting the formal semantics of PSL with local variables to all of PSL (issue 67). Proposal A’ provides semantics for PSL without truncated words, abort and clock operators. In this proposal we augment the entire formal semantics of PSL (including the above constructs) with local variables. In addition, we add semantics for procedural blocks (issue ...

Temporal Logic Made Practical

In the late seventies, Pnueli suggested that functional properties of reactive systems be formally expressed in temporal logic. In order that model checking such a logic be possible, it must have sufficient expressive power, its semantics must be formally defined in a rigorous way, and the complexity of model checking it must be well understood and reasonable. In order to allow widespread adopt...